Interval ordered information systems

Interval ordered information systems

Interval information systems are generalizedmodels of single-valued information systems. By introducing a dominance relation to interval information systems, we propose a ranking approach for all objects based on dominance classes and establish a dominance-based rough set approach, which is mainly based on substitution of the indiscernibility relation by the dominance relation. Furthermore, we ...

Set-valued ordered information systems

Set-valued ordered information systems can be classified into two categories: disjunctive and conjunctive systems. Through introducing two new dominance relations to set-valued information systems, we first introduce the conjunctive/disjunctive set-valued ordered information systems, and develop an approach to queuing problems for objects in presence of multiple attributes and criteria. Then, w...

Ordered Interval Routing

An Interval Routing Scheme (IRS) represents the routing tables in a network in a space-efficient way by labeling each vertex with an unique integer address and the outgoing edges at each vertex with disjoint subintervals of these addresses. An IRS that has at most k intervals per edge label is called a k-IRS. In this thesis, we propose a new type of interval routing scheme, called an Ordered In...

Sheaves of Ordered Spaces and Interval Theories

We study the homotopy theory of locally ordered spaces, that is manifolds with boundary whose charts are partially ordered in a compatible way. Their category is not particularly well-behaved with respect to colimits. However, this category turns out to be a certain full subcategory of a topos of sheaves over a simpler site. The ambient topos makes available some general homotopical machinery.

Signed Interval Logi on Totally Ordered Domains